منابع مشابه
Spanning Trees of Small Degree
In this paper we show that pseudo-random graphs contain spanning trees of maximum degree 3. More specifically, (n, d, λ)-graphs with sufficiently large spectral gap contain such spanning trees.
متن کاملEmbedding spanning subgraphs of small bandwidth
In this paper we prove the following conjecture by Bollobás and Komlós: For every γ > 0 and positive integers r and ∆, there exists β > 0 with the following property. If G is a sufficiently large graph with n vertices and minimum degree at least ( r−1 r +γ)n and H is an r-chromatic graph with n vertices, bandwidth at most βn and maximum degree at most ∆, then G contains a copy of H.
متن کاملIndependent Spanning Trees with Small Stretch
A pair of spanning trees rooted at a vertex r are independent if for every vertex v the pair of unique tree paths from v to the root r are disjoint. This paper presents the rst analysis of the path lengths involved in independent spanning trees in 2-edge-connected and 2-vertex-connected graphs. We present upper and lower bounds on the stretch factors of pairs of independent spanning trees, wher...
متن کاملEmbedding Spanning Bipartite Graphs of Small Bandwidth
Böttcher, Schacht and Taraz [6] gave a condition on the minimum degree of a graph G on n vertices that ensures G contains every r-chromatic graph H on n vertices of bounded degree and of bandwidth o(n), thereby proving a conjecture of Bollobás and Komlós [15]. We strengthen this result in the case when H is bipartite. Indeed, we give an essentially best-possible condition on the degree sequence...
متن کاملFigure 12.2: A Spanning Tree Produced by an On-Line Small Spanning Tree Algorithm
In all of the previous chapters, algorithms are designed under the assumption that the whole picture of the data are available for us before the algorithm is executed. That is, problems are solved together with complete information of the data. However, this is not necessarily true in reality. Consider the disk scheduling problem. The requests of disk servers are totally unknown to the algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 1996
ISSN: 0895-4801,1095-7146
DOI: 10.1137/s0895480194266331